Algorithmic construction of optimal symmetric Latin hypercube designs

We propose symmetric Latin hypercubes for designs of computer exepriment. The goal is to ooer a compromise between computing eeort and design opti-mality. The proposed class of designs has some advantages over the regular Latin hypercube design with respect to criteria such as entropy and the minimum intersite distance. An exchange algorithm is proposed for constructing optimal symmetric Latin hypercube designs. This algorithm is compared 1 with two existing algorithms by Park (1994) and Morris and Mitchell (1995). Some examples, including a real case study in the automotive industry, are used to illustrate the performance of the new designs and the algorithms.